/*
#include <stack>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <vector>
#include <iostream>
#include <sstream>
using namespace std;
struct TreeNode{
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x):val(x),left(NULL),right(NULL){}
};

void inorderTraversalChild(vector<int>&result,TreeNode* root){
	if(root){
		inorderTraversalChild(result,root->left);
		result.push_back(root->val);
		inorderTraversalChild(result,root->right);
	}
}

vector<int> inorderTraversal(TreeNode* root) {
	vector<int>result;
	inorderTraversalChild(result,root);
	return result;
}
int main(){
	int a[]={1,2,3,4,5};
	vector<int> nums1(a,a+sizeof(a)/sizeof(int));

	restoreIpAddresses("1010010");
	cout<<endl;
	system("pause");
}
*/